On the Size Complexity of Rotating and Sweeping Automata
نویسندگان
چکیده
We examine the succinctness of one-way, rotating, sweeping, and two-way deterministic finite automata (1dfas, rdfas, sdfas, 2dfas). Here, a sdfa is a 2dfa whose head can change direction only on the endmarkers and a rdfa is a sdfa whose head is reset on the left end of the input every time the right endmarker is read. We introduce a list of language operators and study the corresponding closure properties of the size complexity classes defined by these automata. Our conclusions reveal the logical structure of certain proofs of known separations in the hierarchy of these classes and allow us to systematically construct alternative problems to witness these separations.
منابع مشابه
Size complexity of rotating and sweeping automata
We examine the succinctness of one-way, rotating, sweeping, and two-way deterministic finite automata (1dfas, rdfas, sdfas, 2dfas) and their nondeterministic and randomized counterparts. Here, a sdfa is a 2dfa whose head can change direction only on the endmarkers and a rdfa is a sdfa whose head is reset to the left end of the input every time the right end-marker is read. We study the size com...
متن کاملETH Library Infinite vs. Finite Size-Bounded Randomized Computations
Randomized computations can be very powerful with respect to space complexity, e. g., for logarithmic space, LasVegas is equivalent to nondeterminism. This power depends on the possibility of infinite computations, however, it is an open question if they are necessary. We answer this question for rotating finite automata (rfas) and sweeping finite automata (sfas). We show that LasVegas rfas (sf...
متن کاملSize-dependent thermoelastic analysis of rotating nanodisks of variable thickness
This paper contains a strain gradient theory to capture size effects in rotating nanodisks of variable thickness under thermal and mechanical loading. Material properties of nanodisks have been taken homogeneous material. The strain gradient theory and the Hamilton’s principle are employed to derive the governing equations. Due to complexity of the governing differential equation and boundary c...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملA Technique for Proving Lower Bounds on the Size of Sweeping Automata
A sweeping automaton is a two-way deterministic finite automaton which makes turns only at the endmarkers. Sipser [12] has proved that one-way nondeterministic finite automata can be exponentially more succinct in sizes than sweeping automata. In this paper, we propose a technique based on the work in [6] for establishing lower bounds on the size of sweeping automata. We show that Sipser’s tech...
متن کامل